Improvements on Spectral Bisection
نویسندگان
چکیده
منابع مشابه
New Spectral Lower Bounds on the Bisection Width of Graphs
The communication overhead is a major bottleneck for the execution of a process graph on a parallel computer system. In the case of two processors, the minimization of the communication can be modeled by the graph bisection problem. The spectral lower bound of 2jV j 4 for the bisection width of a graph is well-known. The bisection width is equal to 2jV j 4 iff all vertices are incident to 2 2 c...
متن کاملOn the Maximal Error of Spectral Approximation of Graph Bisection
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class of graphs, we prove that the standard spectral graph bisection can produce bisections that are far from optimal. In particular, we show that the maximum error...
متن کاملAbilities and Limitations of Spectral Graph Bisection
Spectral based heuristics belong to well-known commonly used methods which determines provably minimal graph bisection or outputs “fail” when the optimality cannot be certified. In this paper we focus on Boppana’s algorithm which belongs to one of the most prominent methods of this type. It is well known that the algorithm works well in the random planted bisection model – the standard class of...
متن کاملUnification of Spectral and Inertial Bisection
We discuss algorithms for graph bisection which are relevant to the distribution of tasks, such as the elements and nodes of an unstructured mesh to the processors of a parallel computer. Starting with a cost function consisting of a part to ensure equal numbers of tasks for each processor, and a part to minimize communication time between processors, we derive the spectral bisection method, wh...
متن کاملSpectral bisection of graphs and connectedness
Article history: Received 9 October 2013 Accepted 5 February 2014 Available online 26 February 2014 Submitted by M. Tsatsomeros MSC: 05C50
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2021
ISSN: 1081-3810
DOI: 10.13001/ela.2020.4993